package leetcode.tree;

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

import leetcode.tree.common.Node;
import leetcode.tree.common.TreeUtils;

import java.util.List;

class Solution590 {
    public List<Integer> postorder(Node root) {
        return TreeUtils.postorder(root);

    }
}

public class leetcode590 {
    public static void main(String[] args) {
        Solution590 solution590 = new Solution590();
        solution590.postorder(new Node(1));
    }
}
